Precomputation for Rainbow Tables has Never Been so Fast

Cryptanalytic time-memory trade-offs (TMTOs) are techniques commonly used in computer security e.g., to crack passwords. However, TMTOs usually encounter practice a bottleneck that is the time needed perform precomputation phase (preceding attack). We introduce this paper technique, called distributed filtration-computation, significantly reduces without any negative impact online phase. Experiments performed on large problems with 128-core perfectly match theoretical expectations. construct rainbow table for space \(N=2^{42}\) approximately 8 h instead of 50 usual way generate table. also show efficiency our technique very close from lower bound.